Relational Formalism, Linguistic Theory and Legal Construction
نویسنده
چکیده
Legal formalism and legal relationalism are traditionally thought of as defining opposite poles of jurisprudential analysis. This study develops the notion of “relational formalism” as it emerges from practices of commercial law and from linguistic theory. As an interpretation of practice, relational formalism—although maintaining the precedence of formalist construction over functional analysis—does so while responding to practical concerns and interests entailed by relations. It argues that legal formalism needs not be an expression of positivistic commitments, and can be approached on relational grounds, and must respond to those. The study empirically analyzes a well-known problem of negotiable instruments to support both the tenability of relational formalism and its theoretical and practical fruitfulness. It then uses performative linguistics to sustain a relational construction of formalism. Finally, it claims that tacit judicial divergence over formalism, rather than doctrinal differences, sometimes explains conflicting outcomes in similar cases. I. Preface: Dogmatic and Relational Formalism II. Formalism in the Law of Negotiable Instruments III. Law or Practice? The Problem with Quasi Instruments IV. The Formalist Catch V. What Do Checks Do? A View From Speech Act Theory VI. Form or Reliance? Formalism in the Courts
منابع مشابه
Relational Formalism
Legal formalism and legal relationalism are traditionally thought of as defining opposite poles of jurisprudential analysis. This study develops the notion of “relational formalism” as it emerges from practices of commercial law and from linguistic theory. As an interpretation of practice, relational formalism—although maintaining the precedence of formalist construction over functional analysi...
متن کاملRelational Programming Laws in the Tree, List, Bag, Set Hierarchy
In this paper we demonstrate that the basic rules and calculational techniques used in two extensively documented program derivation methods can be expressed, and, indeed, can be generalised within a relational theory of datatypes. The two methods to which we refer are the so-called “Bird-Meertens formalism” for the construction of functional programs and the “Dijkstra-Feijen calculus” for the ...
متن کاملRestricting Logic Grammars with Government-Binding Theory
A parser formalism for natural languages that is so restricted as to rule out the definition of linguistic structures that do not occur in any natural language can make the task of grammar construction easier, whether it is done manually (by a programmer) or automatically (by a grammar induction system). A restrictive grammar formalism for logic programming languages is presented that imposes s...
متن کاملLinguistic Construction of a Winning Apology
The study analyzes the apology delivered by the then-democratic Presidential contender in 2007, Senator Barack H. Obama, to the Indian-American community. This apology succeeded in convincing American citizens of Obama’s goodwill and clean political standards, which eventually led him to surpass his chief opponent, Senator Hillary R. Clinton and become the President of the United States. The st...
متن کاملRestricting Logic Grammars
A parser formalism for natural languages that is so restricted as to rule out the definition of linguistic structures that do not occur in any natural language can make the task of grammar construction easier, whether it is done manually (by a programmer) or automatically (by a grammar induction system). A restrictive grammar formalism for logic programming languages is presented that imposes s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013